Dynamic job-shop scheduling using reinforcement learning agents
نویسندگان
چکیده
Static and dynamic scheduling methods have attracted a lot of attention in recent years. Among these, dynamic scheduling techniques handle scheduling problems where the scheduler does not possess detailed information about the jobs, which may arrive at the shop at any time. In this paper, an intelligent agent based dynamic scheduling system is proposed. It consists of two independent components: the agent and the simulated environment. The agent selects the most appropriate priority rule according to the shop conditions in real time, while simulated environment performs scheduling activities using the rule selected by the agent. The agent is trained by an improved reinforcement learning algorithm through the learning stage and then it successively makes decisions to schedule the operations. © 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
Neuro-Genetic Order Acceptance in a Job Shop setting
In this paper a new neuro-genetic architecture is presented that solves a profit oriented dynamic job shop problem. In the job shop order acceptance and scheduling problem new jobs arrive continuously and because of insufficient job shop capacity, a selection has to be made among the offered jobs. The goal is to find an order acceptance policy, which is supported by a scheduling policy, that ma...
متن کاملAdaptive Reactive Job-shop Scheduling with Reinforcement Learning Agents
Traditional approaches to solving job-shop scheduling problems assume full knowledge of the problem and search for a centralized solution for a single problem instance. Finding optimal solutions, however, requires an enormous computational effort, which becomes critical for large problem instance sizes and, in particular, in situations where frequent changes in the environment occur. In this ar...
متن کاملCombining Stochastic Task Models with Reinforcement Learning for Dynamic Scheduling
We view dynamic scheduling as a sequential decision problem. Firstly, we introduce a generalized planning operator, the stochastic task model (STM), which predicts the effects of executing a particular task on state, time and reward using a general procedural format (pure stochastic function). Secondly, we show that effective planning under uncertainty can be obtained by combining adaptive hori...
متن کاملA MAS Reinforcement Learning Approach for Indeterministic Multi-Layer Job-Shop Scheduling
The indeterministic multi-layer job-shop scheduling problem, which is the extension of the traditional job-shop scheduling, is introduced in this paper. The framework and some key issues of the problem are discussed. A multi-agent reinforcement learning approach, named memory-evolution-based MAS reinforcement learning algorithm, is breifly introduced too. Experiment results show that our approa...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Robotics and Autonomous Systems
دوره 33 شماره
صفحات -
تاریخ انتشار 2000